Design and Evaluation of Novel Effective Montgomery Modular Multiplication Architecture

نویسندگان

  • Maryam Moayedi
  • Abdalhossein Rezai
چکیده

Secure communication is a challenging issue in modern industries and critical infrastructures. The core technology used for securing the communication is cryptography. Modular multiplication is an important operation in cryptosystems. This paper investigates a novel modular multiplication algorithm and architecture. In the proposed algorithm and architecture, the parallel architecture and compact SD technique are utilized to improve the performance of modular multiplication operation and cryptosystems. The proposed architecture is implemented on Xilinx Virtex 5 FPGA. The complexity analysis results and FPGA implementation results show that the proposed modular multiplication algorithm and architecture provide improvement on the total computation time and area×time complexity compared to other modified modular multiplication algorithms and architectures. Keyword: Security, modular multiplication architecture, FPGA, parallel computation, compact SD

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Area Efficient Montgomery Modular Multiplication Architecture with Low-memory Bandwidth Requirement

Montgomery modular multiplication is widely used in public-key cryptosystems. This work shows how to relax the data dependency in conventional word-based algorithms to maximize the possibility of reusing the current words of variables. With the greatly relaxed data dependency, we then proposed a novel scheduling scheme to alleviate the number of memory access in the developed scalable architect...

متن کامل

FPGA Design, Implementation and Analysis of Scalable Low Power Radix 4 Montgomery Multiplication Algorithm

This paper proposes an efficient algorithm and Processing Element (PE) architecture for a Multiple Word Radix 4 Montgomery Modular (MWR4MM) multiplier. This architecture is developed considering an important design factor power consumption in addition to other design factors that is considered previously in many publications such as performance and scalability. To increase performance, we used ...

متن کامل

FPGA Implementation of Modified Montgomery for RSA Cryptosystem

Modular multiplication is a key operation in public key cryptosystems like RSA. Among modular multiplication methods, Montgomery modular multiplication is an efficient algorithm suitable for hardware implementation. In this paper, a Modified Montgomery Modular Multiplication design is proposed with carry save adder architecture and parallel simplified quotient computation for the next iteration...

متن کامل

High Speed Systolic Montgomery Modular Multipliers for RSA Cryptosystems

Montgomery modular multiplication is one of the most important and frequently used techniques to accelerate the time consuming mathematical operations used in RSA cryptosystems. In this paper, a modified Montgomery modular multiplication algorithm is presented where the carry-save operations are split into two cycles so as to eliminate the generation of the data-dependent control signal from do...

متن کامل

Bit-Serial and Digit-Serial GF(2) Montgomery Multipliers using Linear Feedback Shift Registers

This work presents novel multipliers for Montgomery multiplication defined on binary fields GF(2). Different to state of the art Montgomery multipliers, this work uses a Linear Feedback Shift Register (LFSR) as the main building block. We studied different architectures for bit-serial and digit-serial Montgomery multipliers using the LFSR and the Montgomery factors x and xm−1. The proposed mult...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016